Centrality-Based Network Coder Placement for Peer-To-Peer Content Distribution
نویسندگان
چکیده
منابع مشابه
Network Coder Placement for Peer-to-Peer Content Distribution
Network coding has been shown to achieve optimal multicast throughput, yet at an expensive computation cost: every node in the network has to code. Interested in minimizing resource consumption of network coding while maintaining its performance, in this paper, we propose a practical network coder placement algorithm which achieves comparable content distribution time as network coding, and at ...
متن کاملTAC: A Topology-Aware Chord-based Peer-to-Peer Network
Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...
متن کاملTrust Based Content Distribution for Peer-To- Peer Overlay Networks
In peer-to-peer content distribution the lack of a central authority makes authentication difficult. Without authentication, adversary nodes can spoof identity and falsify messages in the overlay. This enables malicious nodes to launch man-in-the-middle or denial-of-service attacks. In this paper, we present a trust based content distribution for peer-to-peer overlay networks, which is built on...
متن کاملPotentials and challenges of peer-to-peer based content distribution
Multimedia content currently accounts for over three quarters of all Internet traffic. This increase in traffic volume and content availability derives from a paradigm shift from the traditional text and picture based Web, to more resource demanding audio and video content. A controversial driver for this development is content distribution systems based on peer-to-peer overlay networks. Floodi...
متن کاملEfficient Peer-to-Peer Content Distribution
We consider the problem of distributing data to a large and dynamic network of nodes. We formalize the next-step problem, which is intuitively the next action that each peer in the content distribution network should take, where an action is the transfer of one file part from a neighboring node. We formulate the next-step problem as an integer programming problem and use a probabilistic graphic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of Computer Networks & Communications
سال: 2013
ISSN: 0975-2293,0974-9322
DOI: 10.5121/ijcnc.2013.5312